翻訳と辞書 Words near each other ・ Type M ・ Type metal ・ Type Museum ・ Type N3 ship ・ Type O Negative ・ Type O Negative discography ・ Type of Constans ・ Type of service ・ Type of Way ・ Type P3 ship ・ Type physicalism ・ Type punning ・ Type qualifier ・ Type rating ・ Type RO 15 ・ Type rule ・ Type S ・ Type safety ・ Type Sage ・ Type scene ・ Type set ・ Type signature ・ Type site ・ Type species ・ Type specimen (mineralogy) ・ Type system ・ Type system of the Royal Navy ・ Type theory ・ Type Three platform ・ Type three secretion system Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Type rule ： ウィキペディア英語版 Type rule In type theory, a type rule is an inference rule that describes how a type system assigns a type to a syntactic construction. These rules may be applied by the type system to determine if a program is well typed and what type expressions have. A prototypical example of the use of type rules is in defining type inference in the simply typed lambda calculus, which is the internal language of Cartesian closed categories. == Notation == An expression $e$ of type $\backslash tau$ is written as $e\backslash !:\backslash !\backslash tau$. The typing environment is written as $\backslash Gamma$. The notation for inference is the usual one for sequents and inference rules, and has the following general form :$$ \frac The sequents above the line are the premises that must be fulfilled for the rule to be applied, yielding the conclusion: the sequents below the line. This can be read as: ''if expression $e\_i$ has type $\backslash tau\_i$ in environment $\backslash Gamma\_i$, for all $i=1..n$, then the expression $e$ will have an environment $\backslash Gamma$ and type $\backslash tau$''. For example, a simple language to perform arithmetic calculations on real numbers may have the following rules :$$ \frac \qquad \frac \qquad \cdots A type rule may have no premises, and usually the line is omitted in these cases. A type rule may also change an environment by adding new variables to a previous environment; for example, a declaration may have the following type rule, where a new variable $id$, with type $\backslash tau\text{'}$, is added to $\backslash Gamma$: :$$ \frac e \text :\!\tau} Here the syntax of the let expression is that of Standard ML. Thus type rules can be used to derive the types of composed expressions, much like in natural deduction. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Type rule」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.